Grigni: [21] Well-Connected Separators for Planar Graphs

نویسندگان

  • Michelangelo Grigni
  • Andrzej P. Woloszyn
چکیده

Given an n-vertex weighted planar graph G, a separator is a subset S of vertices such that each component of G S has at most two-thirds of the original weight. We give an algorithm nding a separator while balancing these two parameters of G[S]: the number of components, and the cost of a minimum spanning forest. In particular, given uniform edge costs and a positive integer k pn, we nd a separator S such that jSj = O(n=k) and G[S] has O(k) components.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Well-Connected Separator for Planar Graphs

We prove a separator theorem for planar graphs, which has been used to obtain polynomial time approximation schemes for the metric TSP [8] and the 2edge-connected and biconnected spanning subgraph problems [6] in unweighted planar graphs. We also prove an extension of the theorem which was used in [3] to find quasi-polynomial time approximation schemes for the weighted cases of the latter two p...

متن کامل

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.

متن کامل

Approximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs

We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs. From this we derive quasi-polynomial time ap...

متن کامل

A PTAS for the Minimum Cost 2-edge-Connected Spanning Subgraph in Planar Graphs

Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanning subgraph of minimum cost. We present a polynomial time approximation scheme (PTAS) for this problem when the costs are uniform, or when the total cost of G is within a constant factor of the optimal.

متن کامل

Grigni: [15] Approximate TSP in Graphs with Forbidden Minors

Given as input an edge-weighted graph, we analyze two algorithms for nding subgraphs with low total edge weight. The rst algorithm nds a separator subgraph with a small number of components, and is analyzed for graphs with an arbitrary excluded minor. The second algorithm nds a spanner with small stretch factor, and is analyzed for graphs in a hereditary family G(k). These results imply (i) a Q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000